Flip Graphs of Degree-Bounded (Pseudo-)Triangulations⋆
نویسندگان
چکیده
We study flip graphs of (pseudo-)triangulations whose maximum vertex degree is bounded by a constant k. In particular, we consider (pseudo-)triangulations of sets of n points in convex position in the plane and prove that their flip graph is connected if and only if k > 6; the diameter of the flip graph is O(n). We also show that for general point sets flip graphs of minimum pseudo-triangulations can be disconnected for k ≤ 9, and flip graphs of triangulations can be disconnected for any k.
منابع مشابه
Flip Graphs of Bounded-Degree Triangulations
We study flip graphs of triangulations whose maximum vertex degree is bounded by a constant k. In particular, we consider triangulations of sets of n points in convex position in the plane and prove that their flip graph is connected if and only if k > 6; the diameter of the flip graph is O(n). We also show that, for general point sets, flip graphs of pointed pseudo-triangulations can be discon...
متن کامل3-Colorability of Pseudo-Triangulations
Deciding 3-colorability for general plane graphs is known to be an NP-complete problem. However, for certain classes of plane graphs, like triangulations, polynomial time algorithms exist. We consider the family of pseudo-triangulations (a generalization of triangulations) and prove NP-completeness for this class. The complexity status does not change if the maximum face-degree is bounded to fo...
متن کاملInternational Journal of Computational Geometry & Applications
Deciding 3-colorability for general plane graphs is known to be an NP-complete problem. 31 However, for certain families of graphs, like triangulations, polynomial time algorithms 32 exist. We consider the family of pseudo-triangulations, which are a generalization of 33 triangulations, and prove NP-completeness for this class. This result also holds if we 34 bound their face degree to four, or...
متن کاملFlips in combinatorial pointed pseudo-triangulations with face degree at most four
In this paper we consider the flip operation for combinatorial pointed pseudo-triangulations where faces have size 3 or 4, so-called combinatorial 4-PPTs. We show that every combinatorial 4-PPT is stretchable to a geometric pseudo-triangulation, which in general is not the case if faces may have size larger than 4. Moreover, we prove that the flip graph of combinatorial 4-PPTs is connected and ...
متن کاملCounting and enumerating pseudo-triangulations with the greedy flip algorithm∗
This paper studies pseudo-triangulations for a given point set in the plane. Pseudo-triangulations have many properties of triangulations, and have more freedom since polygons with more than three vertices are allowed as long as they have exactly inner angles less than π. In particular, there is a natural flip operation on every internal edge. We establish fundamental properties of pseudo-trian...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009